pub fn odd_fibnacci_sum(limit: u32) -> u32 {
    let mut sum = 0;
    let mut a = 0;
    let mut b = 1;

    while b < limit {
        if b % 2 != 0 {  // 检查是否为奇数
            sum += b;
        }

        // 生成下一个斐波那契数
        let next = a + b;
        a = b;
        b = next;
    }

    sum
}
